Maximal Lattice-Free Convex Sets in Linear Subspaces
نویسندگان
چکیده
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result extends a theorem of Lovász characterizing maximal lattice-free convex sets in R.
منابع مشابه
Minimal Inequalities for an Infinite Relaxation of Integer Programs
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of R. This result extends a theorem of Lovász characterizing maximal lattice-free convex sets. We then consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal S-free convex sets. 1 Maximal S-free convex sets Let ...
متن کاملA Geometric Perspective on Lifting
Recently, it has been shown that minimal inequalities for a continuous relaxation of mixed integer linear programs are associated with maximal lattice-free convex sets. In this paper we show how to lift these inequalities for integral nonbasic variables by considering maximal lattice-free convex sets in a higher-dimensional space. We apply this approach to several examples. In particular we ide...
متن کاملThe Triangle Closure is a Polyhedron
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with certain families of lattice-free sets are polyhedra. For a long time, the only result known was the celebrated theorem of Cook, Kannan and Schrijver who showe...
متن کاملAn Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form S := {x : π0 ≤ π T x ≤ π0 + 1} called split sets. The set obtained by adding all split cuts is called the split closure, and the split closure is known to be a polyhedron. A split set S has max-facet-width equal to one in the sense that max{π x : x ∈ S}− min{π...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 35 شماره
صفحات -
تاریخ انتشار 2010